Embedding Default Theories in Propositional Argumentation Systems
نویسندگان
چکیده
In this paper we present a transformation of propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter’s default logic in the framework of argumentation systems. This means that computing extension, or determining if a given formula belongs to one extension or all extensions can be answered without leaving the field of monotonic propositional logic. Interestingly, this framework allows to immediately recognize the special cases of default theories having none or exactly one “trivial” extension where no default is applicable. The transformation provided is exact and linear in the number of defaults.
منابع مشابه
Embedding default logic in propositional argumentation systems
In this paper we present a transformation of finite propositional default theories into socalled propositional argumentation systems. This transformation allows to characterize all notions of Reiter’s default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered wi...
متن کاملPropositional Argumentation Systems vs Theorist
Propositional argumentation systems are based on assumption based reasoning and used for computing arguments which support a given hypotheses Assumption based reasoning is closely related to hypothetical default theories or inference through theory formation The latter approach known as the Theorist frame work has well known relations to abduction and default reasoning In this paper proposition...
متن کاملPropositional Argumentation and Causal Reasoning
The paper introduces a number of propositional argumentation systems obtained by gradually extending the underlying language and associated monotonic logics. An assumption-based argumentation framework [Bondarenko et al., 1997] will constitute a special case of this construction. In addition, a stronger argumentation system in a full classical language will be shown to be equivalent to a system...
متن کاملModel-Preference Default Theories
Most formal theories of default inference have very poor computational properties, and are easily shown to be intractable, or worse, undecidable. We are therefore investigating limited but efficiently computable theories of default reasoning. This paper defines systems of Propositional Model-Preference Defaults, which provide a true modeltheoretic account of default inference with exceptions. T...
متن کاملDefault Reasoning Using Classical Logic
In this paper we show how propositional default theories can be characterized by classical propositional theories: for each nite default theory, we show a classical propositional theory such that there is a one-to-one correspondence between models for the latter and extensions of the former. This means that computing extensions and answering queries about coherence, set-membership and set-entai...
متن کامل